QuikFix A Repair-based Timetable Solver
نویسندگان
چکیده
QuikFix is a software program for solving timetabling problems. The software adapts repair-based heuristic search known in SAT solving to the timetabling domain. A high-level timetabling-specific model enforces structural constraints and allows for meaningful moves in the search space, such as swaps of the time slots or venues of events. QuikFix uses known techniques to improve the search performance, such as multi-starts, tabu lists, and strategic oscillation. The software is easily extensible through the use of object-oriented programming techniques and has been employed for the timetabling of a Singapore K-12 international school, and as an entry to the ITC 2007 timetabling competition.
منابع مشابه
A Case Study in Periodic Timetabling
In the overwhelming majority of public transportation companies, designing a periodic timetable is even nowadays largely performed manually. Software tools only support the planners in evaluating a periodic timetable, or by letting them comfortably shift sets of trips by some minutes, but they rarely use optimization methods. One of the main arguments against optimization is that there is no cl...
متن کاملSystem Demonstration of Interactive Course Timetabling
This system demonstration presents an approach to interactive timetabling used by the UniTime university timetabling system. This application, which is publicly available under an open source license, has been successfully applied at Purdue University [8], a large public university (39,000 students) with a broad spectrum of programs at the undergraduate and graduate levels. The complete system ...
متن کاملA Mathematical Approach for Reducing the Maximum Traction Energy : The Case of Korean MRT Trains
This paper describes a reduction in the peak traction energy of mass rapid transit (MRT) railways through timetabling. We develop a mixed integer programming (MIP) model that minimizes the maximum traction energy that occurs when trains are running simultaneously. We tried two approaches. In the first approach, we use the commercial MIP solver CPLEX. In the second approach, we propose a heurist...
متن کاملConstraint Priorities - a Way of Getting an Optimal Timetable Fully Automatically. Three Steps Into the Modern Timetable Scheduler
The presentation goes through all the system features which make the new timetabling technology unique and efficient, presenting constraint priorities as the most important innovations in the scheduling process. The system of priorities exists in the main three fundamental modules: inconsistency detection system, optimization module and solver. The complete constraint system is also presented a...
متن کاملOptimizing regular symmetric timetables: a method to reach the best modal split for railway
A regular timetable is a collection of events that repeat themselves every specific time span. This even structure, whenever applied at a whole network, leads to several benefits both for users and the company, although some issues are introduced, especially about dimensioning the service. It is therefore fundamental to properly consider the interaction between the transport demand and supply, ...
متن کامل